Pattern decomposition for tessellation automata
نویسندگان
چکیده
منابع مشابه
Decomposition Phenomenon in One-Dimensional Scope-Three Tessellation Automata with Arbitrary Number of States
The tessellation automaton (TA) is a formalization of the concept of an infinite regular array of identical finite-state machines uniformly interconnected in the sense that each machine can directly receive information by means of interconnecting wires from a finite number of neighboring machines where the spatial arrangement of these neighboring machines is the same relative to each machine in...
متن کاملCellular Automata in the Triangular Tessellation
For t he discussion below t he following definit ions are helpful. A semito-talistic CA rule is a rul e for a cellular aut omaton (CA) where (a) we tally t he living neighbors t o a cell without regard to their orient atio n wit h respect t o th at cell, and (b) t he ru le applied t o a cell may depend upon its current status. A lifelike rule (LFR rul e) is a semit otalist ic CA rul e where (1)...
متن کاملCertain Relations between Properties of Maps of Tessellation Automata
In a different approach, Hedlund [4], Sears [13], and Ryan [12] defined the shift dynamical system and investigated the properties of the continuous transformations which commute with the shift transformations, and showed many interesting results in one-dimensional tessellation spaces. Hedlund conjectured that in some sense, the set A of all parallel maps which are injective on the set C of all...
متن کاملCellular Automata for Pattern Recognition
Generalized Multiple Attractor CA (GMACA) is introduced for elementary pattern recogni‐ tion (Ganguly et al., 2002; Maji et al., 2003; 2008). It is a promising pattern classifier using a simple local network of Elementary Cellular Automata (ECA) (Wolfram, 1994), called attrac‐ tor basin that is a reverse tree-graph. GMACA utilizes a reverse engineering technique and genetic algorithm in orderin...
متن کاملDecomposition of Constraint Automata
Reo is a coordination language that can be used to model different systems. Constraint automata form a formal semantics for Reo connectors based on a co-algebraic model of streams. In this paper, we introduce complete constraint automata (CCA) whose extra information about entropy states helps in analyzing and decomposing them into Reo circuits. We show that a complete constraint automaton is i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1981
ISSN: 0304-3975
DOI: 10.1016/0304-3975(81)90043-8